Thresholds of Random Quasi-Abelian Codes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hermitian self-dual quasi-abelian codes

Quasi-abelian codes constitute an important class of linear codes containing theoretically and practically interesting codes such as quasi-cyclic codes, abelian codes, and cyclic codes. In particular, the sub-class consisting of 1-generator quasi-abelian codes contains large families of good codes. Based on the well-known decomposition of quasi-abelian codes, the characterization and enumeratio...

متن کامل

One – generator quasi – abelian codes revisited ∗

The class of 1-generator quasi-abelian codes over finite fields is revisited. Alternative and explicit characterization and enumeration of such codes are given. An algorithm to find all 1-generator quasi-abelian codes is provided. Two 1-generator quasi-abelian codes whose minimum distances are improved from Grassl’s online table are presented. 2010 MSC: 94B15, 94B60, 16A26

متن کامل

Quantum Error-Correction Codes on Abelian Groups

We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.

متن کامل

Efficient Encryption from Random Quasi-Cyclic Codes

We propose a framework for constructing efficient code-based encryption schemes from codes that do not hide any structure in their public matrix. The framework is in the spirit of the schemes first proposed by Alekhnovich in 2003 and based on the difficulty of decoding random linear codes from random errors of low weight. We depart somewhat from Aleknovich’s approach and propose an encryption s...

متن کامل

Cumulative Distance Enumerators of Random Codes and their Thresholds

Cumulative weight enumerators of random linear codes are introduced, their asymptotic properties are studied, and very sharp thresholds are exhibited; as a consequence, it is shown that the asymptotic GilbertVarshamov bound is a very sharp threshold point for the density of the linear codes whose relative distance is greater than a given positive number. For arbitrary random codes, similar sett...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2015

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2014.2368138